Experimental Evaluation of Graph Classification with Hadamard Code Graph Kernels
نویسندگان
چکیده
منابع مشابه
graphkernels: R and Python packages for graph comparison
Summary Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based ker...
متن کاملStochastic flows related to Walsh Brownian motion
We define an equation on a simple graph which is an extension of Tanaka’s equation and the skew Brownian motion equation. We then apply the theory of transition kernels developed by Le Jan and Raimond and show that all the solutions can be classified by probability measures.
متن کاملSymbolic Learning vs. Graph Kernels: An Experimental Comparison in a Chemical Application
In this paper we present a quantitative comparison between two approaches, Graph Kernels and Symbolic Learning, within a classification scheme. The experimental case-study is the predictive toxicology evaluation, that is the inference of the toxic characteristics of chemical compounds from their structure. The results demonstrate that both approaches are comparable in terms of accuracy, but pre...
متن کاملClassification of rings with toroidal annihilating-ideal graph
Let R be a non-domain commutative ring with identity and A(R) be theset of non-zero ideals with non-zero annihilators. We call an ideal I of R, anannihilating-ideal if there exists a non-zero ideal J of R such that IJ = (0).The annihilating-ideal graph of R is defined as the graph AG(R) with the vertexset A(R) and two distinct vertices I and J are adjacent if and only if IJ =(0). In this paper,...
متن کاملWeisfeiler-Lehman Graph Kernels
In this article, we propose a family of efficient kernels for large graphs with discrete node labels. Key to our method is a rapid feature extraction scheme based on the Weisfeiler-Lehman test of isomorphism on graphs. It maps the original graph to a sequence of graphs, whose node attributes capture topological and label information. A family of kernels can be defined based on this Weisfeiler-L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016